Gemcitabine–cisplatin: A schedule finding study
نویسندگان
چکیده
منابع مشابه
Gemcitabine-cisplatin: a schedule finding study.
PURPOSE To evaluate the tolerability of four alternating cisplatin-gemcitabine schedules. A secondary aim was to evaluate the clinical efficacy of this combination. PATIENTS AND METHODS Forty-one patients with advanced solid tumors received alternating sequences with a 4- and 24-hour interval of cisplatin and gemcitabine. Gemcitabine 800 mg/m2 was administered as a 30-min infusion on day 1, 8...
متن کاملFinding a feasible course schedule using Tabu search
Hertz, A., Finding a feasible course schedule using Tabu search, Discrete Applied Mathematics 35 (1992) 255-270. We consider a course scheduling problem in which the total number of time periods assigned to each topic has to be split into daily amounts of consecutive time periods called daily quantums. These daily quantums may be arbitrary but are bounded by given minimal and maximal values. In...
متن کاملPatients Satisfaction from the Appointment Schedule; a case study in Shahid Sadoughi Specialized Clinic in Yazd
Introduction: Health services rendered by hospitals play an important role in satisfying the society. In this study, the level of patients satisfaction from the appointment schedule of the specialized clinic of Shahid Sadoughi in Yazd wasexamined. Methods: The present descriptive-analytical research was conducted among patients with completed treatment steps using the random sampling method. A...
متن کاملDose--schedule finding in phase I/II clinical trials using a Bayesian isotonic transformation.
A dose-schedule-finding trial is a new type of oncology trial in which investigators aim to find a combination of dose and treatment schedule that has a large probability of efficacy yet a relatively small probability of toxicity. We demonstrate that a major difference between traditional dose-finding and dose-schedule-finding trials is that while the toxicity probabilities follow a simple nond...
متن کاملA dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
We study the problem of (off-line) broadcast scheduling in minimizing total flow time and propose a dynamic programming approach to compute an optimal broadcast schedule. Suppose the broadcast server has k pages and the last page request arrives at time n. The optimal schedule can be computed in O(k3(n + k)k−1) time for the case that the server has a single broadcast channel. For m channels cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Oncology
سال: 1999
ISSN: 0923-7534
DOI: 10.1023/a:1008339425708